A semi-systolic decoder for the PDSC-73 error-correcting code

نویسندگان

  • Kevin Karplus
  • Habib Krit
چکیده

This paper presents a semi-systolic architecture for decoding cyclic linear error-correcting codes at high speed. The architecture implements a variant of Tanner's Algorithm B, modified for simpler and faster implementation. The main features of the architecture are low computational complexity, a simple, regular arrangement of cells for easy layout, short critical paths, and a high clock rate. A prototype chip has been designed to decode a 73-bit perfect difference set code. This 46OOpm x 6800pm chip should achieve 25MHz decoding in 2pm n-well CMOS. The success of the implementation illustrates the value of using technology dependent constraints and cost measures to guide the design of algorithms and architectures.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Single-Trial Adaptive Decoding of Concatenated Codes

In this paper decoding of a concatenated code is considered. We use a Bounded Minimum Distance (BMD) decoder for the inner code correcting up to (d − 1)/2 errors and a Bounded Distance (BD) decoder for the outer code, which corrects ε errors and τ erasures if λε + τ ≤ d − 1, where a real number 1 < λ ≤ 2 is the tradeoff rate between errors and erasures for this outer decoder. Here d and d are t...

متن کامل

The Design and Implementation of General Symmetrical Self-Organizing Map Decoder

Traditional error correcting decoder is designed according to specific algorithm, which is a reverse course of encoding. In this paper, a novel general neural network decoder is proposed in the form of symmetrical self-organizing map (SSOM), which can achieve decoding function to any error correcting codes. The SSOM decoder is tested by decoding low-density parity-check (LDPC) code. The perform...

متن کامل

A high-speed real-time binary BCH decoder

A high-speed real-time decoder for t-errorcorrecting binary Bose-Chaudhuri-Hocquenghem (BCH) codes based on a modified step-by-step decoding algorithm is presented. The average operation cycles for decoding each received word is just equal to the block length of the codeword. The decoder is constructed by three modules: the syndrome module, the comparison module, and the error corrector. Since ...

متن کامل

A New Coding Scheme for Runlength-Limited Channels

A coding scheme for reliable information transmission via a runlength-limited channel is often implemented as a concatenation of an inner modulation code with an outer error-correcting code. The outer decoder has to deal with errors introduced not only by the channel but also by the inner decoder itself. We present a new almost block-decodable rate 1/2 (2,∞)constrained code that avoids error am...

متن کامل

Analog-decoder experiments with subthreshold CMOS soft-gates

A collection of analog “soft-gate” CMOS ASICs operating in subthreshold-mode was implemented in a low-cost semi-custom 0.8 μm technology. These soft-gates allow, in particular, the realization of various decoders for simple error correcting codes on the breadboard level. Measurement results are presented for an (8,4,4) Hamming code.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Discrete Applied Mathematics

دوره 33  شماره 

صفحات  -

تاریخ انتشار 1991